Coordinate descent iterations in fast affine projection algorithm
نویسندگان
چکیده
منابع مشابه
The fast affine projection algorithm
This paper discusses a new adaptive filtering algorithm called fast affine projections (FAP). FAP’s key features include LMS like complexity and memory requirements (low), and RLS like convergence (fast) for the important case where the excitation signal is speech. Another of FAP’s important features is that it causes no delay in the input or output signals. In addition, the algorithm is easily...
متن کاملThe Gauss-seidel Fast Affine Projection Algorithm
In this paper we propose a new stable Fast Affine Projection algorithm based on Gauss -Seidel iterations (GSFAP). We investigate its implementation using the logarithmic number system (LNS) and compare it with other two FAP algorithms. A method to simplify its implementation is also proposed. We show that the 32-bit or 20-bit LNS implementation of the GSFAP algorithm is superior to those of oth...
متن کاملFast exact variable order affine projection algorithm
Variable order affine projection algorithms have been recently presented to be used when not only the convergence speed of the algorithm has to be adjusted but also its computational cost and its final residual error. These kind of affine projection (AP) algorithms improve the standard AP algorithm performance at steady state by reducing the residual mean square error. Furthermore these algorit...
متن کاملA fast instrumental variable affine projection algorithm
We derive a new adaptive filtering algorithm called the Instrumental Variable Affine Projection (IVAP) algorithm and give its fast version (FIVAP algorithm). The IVAP algorithm departs from the AP algorithm and uses an IV. The IV process is generated in a way such that the new algorithm combines between the AP and the Fast Newton Transversal Filter (FNTF) algorithms. Simulations show that the I...
متن کاملA block exact fast affine projection algorithm
This paper describes a block (affine) projection algorithm that has exactly the same convergence rate as the original sample-by-sample algorithm and smaller computational complexity than the fast affine projection algorithm. This is achieved by 1) introducing a correction term that compensates for the filter output difference between the sample-by-sample projection algorithm and the straightfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2005
ISSN: 1070-9908
DOI: 10.1109/lsp.2005.843765